Перевод: с английского на русский

с русского на английский

reducible problem

См. также в других словарях:

  • reducible — [[t]rɪdju͟ːsɪb(ə)l, AM du͟ːs [/t]] ADJ: v link ADJ to n, usu with brd neg If you say that an idea, problem, or situation is not reducible to something simple, you mean that it is complicated and cannot be described in a simple way. [FORMAL] The… …   English dictionary

  • P versus NP problem — Unsolved problems in computer science Is P = NP ? …   Wikipedia

  • P = NP problem — The relationship between the complexity classes P and NP is an unsolved question in theoretical computer science. It is considered to be the most important problem in the field – the Clay Mathematics Institute has offered a $1 million US prize… …   Wikipedia

  • Transformation problem — In 20th century discussions of Karl Marx s economics the transformation problem is the problem of finding a general rule to transform the values of commodities (based on labour according to his labour theory of value) into the competitive prices… …   Wikipedia

  • Closest pair of points problem — Closest pair of points shown in red The closest pair of points problem or closest pair problem is a problem of computational geometry: given n points in metric space, find a pair of points with the smallest distance between them. Its two… …   Wikipedia

  • Quantum mind–body problem — The quantum mind–body problem refers to the philosophical discussions of the mind–body problem in the context of quantum mechanics. Since quantum mechanics involves quantum superpositions, which are not perceived by observers, some… …   Wikipedia

  • Mind–body problem — René Descartes illustration of mind/body dualism. Inputs are passed on by the sensory organs to the epiphysis in the brain and from there to the immaterial spirit …   Wikipedia

  • NP-complete problem — ▪ computer science       any of a class of computational problems for which no efficient solution algorithm has been found. Many significant computer science problems belong to this class e.g., the traveling salesman problem, satisfiability… …   Universalium

  • Morphological analysis (problem-solving) — Morphological Analysis or General Morphological Analysis is a method developed by Fritz Zwicky (1967, 1969) for exploring all the possible solutions to a multi dimensional, non quantified problem complex.[1] Contents 1 Overview 1.1 Morphological… …   Wikipedia

  • Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown …   Wikipedia

  • Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»